Signed bits and fast exponentiation
نویسندگان
چکیده
منابع مشابه
Fast Parallel Montgomery Binary Exponentiation Algorithm Using Canonical- Signed-Digit Recoding Technique
In this paper, a new parallel Montgomery binary exponentiation algorithm was proposed. This algorithm is based on the Montgomery modular reduction technique, binary method, common-multiplicand-multiplication (CMM) algorithm, and the canonical-signed-digit recoding (CSD) technique. By using the CMM algorithm of computing the common part from two modular multiplications, the same common part in t...
متن کاملFast quantum modular exponentiation
concurrent architecture, NTC, neighbor-only, two-qubit gate, concurrent architecture; and Perf, performance relative to VBE algorithm for that architecture, based on CCNOTs for AC and CNOTs for NTC.
متن کاملFast Modular Exponentiation
The well-known binary method computes C = M (mod N) using an average number of 1:5(n 1) multiplications, where n is the number of bits in the binary expansion of E. When the exponent is recoded using the canonical bit recoding technique then the average number of multiplications can be reduced to 1:33(n 1). We show that a further reduction is achieved if the bits of the exponent are scanned at ...
متن کاملFractional Windows Revisited: Improved Signed-Digit Representations for Efficient Exponentiation
This paper extends results concerning efficient exponentiation in groups where inversion is easy (e.g. in elliptic curve cryptography). It examines the right-to-left and left-to-right signed fractional window (RL-SFW and LR-SFW) techniques and shows that both RL-SFW and LR-SFW representations have minimal weight among all signed-digit representations with digit set {±1,±3, . . .,±m, 0}. (Fracti...
متن کاملImproved Techniques for Fast Exponentiation
We present improvements to algorithms for efficient exponentiation. The fractional window technique is a generalization of the sliding window and window NAF approach; it can be used to improve performance in devices with limited storage. Window NAF splitting is an efficient technique for exponentiation with precomputation for fixed bases in groups where inversion is easy (e.g. elliptic curves).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal de Théorie des Nombres de Bordeaux
سال: 2001
ISSN: 1246-7405
DOI: 10.5802/jtnb.301